Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

In this paper we deal with the two-stage hybrid flow shop with dedicated machines. The objective is to minimize the makespan. We first provide some basic properties, a set of lower bounds and two polynomial cases. We then propose a new heuristic based on the established properties. The heuristic tries to sequence jobs in such a way that the obtained makespan corresponds to the lower bound. In the last part, we present the results of a computational experience comparing our heuristic with another heuristic found in the literature. The analysis of those results allows us to appreciate the quality of our proposition.